Semantic nominal terms
نویسندگان
چکیده
Nominal terms use a characteristic combination of features: Two levels of variable: atoms a and unknowns X. Freshness conditions a#X and permutations π. An abstraction [a]r with a distinctive α-equivalence based on freshness and permutation. The first statement above is rendered in nominal terms as the equality judgement b#X ` [a]X =α [b](b a) ·X. a and b denote atoms, which represent the ‘x’ and ‘y’; X denotes an unknown, it represents the ‘t’; b#X is a freshness side-condition, it represents the ‘y 6∈ fv(t)’; (b a) is a permutation meaning ‘map a to b and b to a’, it represents the ‘[y/x]’ (it can do this, since we assume y 6∈ fv(t)). The second statement above is rendered as the nominal unification problem {λ[a]λ[b](b X) ?=? λ[a]λ[a](a Y )}. Nominal terms display some curious properties: −The native notion of equivalence of first-order syntax is syntactic identity. For nominal terms, a notion of derivable α-equality is also needed. We cannot ‘just quotient terms by α-equality’ because α-equality is not a property of terms but of terms-in-freshness-contexts. Thus [a]X = [b](b a) ·X has no meaning, only, for example, ∅ ` [a]X = [b](b a) ·X and b#X ` [a]X = [b](b a) ·X have meaning (the former is not derivable, the latter is). −With first-order and higher-order terms, it is always possible to ‘just pick a fresh name’, and therefore we can ‘always α-convert’. In nominal terms it may not be possible to ‘just pick a fresh atom’ or ‘just αconvert’. For example in the empty freshness context ∅, there is no a such that a#X, and there is no atom b such that we can α-convert a to b in ∅ ` [a]X. 1 Nominal terms also raise a question which has puzzled us for some time. Atoms in nominal terms are denoted by themselves in the cumulative hierarchy (Definition 2.1, or [GP01]). Unknowns take denotation using a valuation (the standard first-order semantics for variables). There is nothing wrong with this but we find it inelegant because it is asymmetric with the denotation of atoms (and also, using functions to give semantics to unknowns is a circularity we want to avoid; one motivation of nominal terms is to axiomatise function binding). We want an alternative
منابع مشابه
Two-level nominal sets and semantic nominal terms: an extension of nominal set theory for handling meta-variables
Nominal sets are a sets-based first-order denotation for variables in logic and programming. In this paper we extend nominal sets to two-level nominal sets. These preserve much of the behaviour of nominal sets—including notions of variable and abstraction—but they include a denotation for variables and meta-variables. Meta-variables are interpreted as infinite lists of distinct variable symbols...
متن کاملNeural Semantic Role Labeling with Dependency Path Embeddings
This paper introduces a novel model for semantic role labeling that makes use of neural sequence modeling techniques. Our approach is motivated by the observation that complex syntactic structures and related phenomena, such as nested subordinations and nominal predicates, are not handled well by existing models. Our model treats such instances as subsequences of lexicalized dependency paths an...
متن کاملA Look inside the Distributionally Similar Terms
We analyzed the details of aWeb-derived distributional data of Japanese nominal terms with two aims. One aim is to examine if distributionally similar terms can be in fact equated with “semantically similar” terms, and if so to what extent. The other is to investigate into what kind of semantic relations constitute (strongly) distributionally similar terms. Our results show that over 85% of the...
متن کاملInterpretation of Nominal Compounds Using Structured Knowledgebases
This thesis investigates different approaches proposed in literature to identify the semantic relations in nominal compounds. Nominal compounds have received a great deal of attention in the last decade, owing to two main reasons the increasing frequency with which nominal compounds occur in language, and the challenges they pose in most natural language processing applications like information...
متن کاملIntegrating OWL and Rules: A Syntax Proposal for Nominal Schemas
This paper proposes an addition to OWL 2 syntax to incorporate nominal schemas, which is a new description-logic style extension of OWL 2 which was recently proposed, and which makes is possible to express “variable nominal classes” within axioms in an OWL 2 ontology. Nominal schemas make it possible to express DL-safe rules of arbitrary arity within the extended OWL paradigm, hence covering th...
متن کامل